INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
نویسندگان
چکیده
منابع مشابه
Interior Methods for Nonlinear Minimum Cost Network Flow Problems
INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS Ryuji Katsura Japan Medical Supply Co., Ltd. Masao Fukushima Kyoto University Toshihide lbaraki Kyoto University (Received March 24,1988; Revised August 5, 1988) In this paper we propose practical algorithms for solving the nonlinear minimum cost network flow problem which has many fields of application such as production-distrib...
متن کاملRelaxation Methods for Minimum Cost Network Flow
We view the optimal single commodity network flow problem with linear arc costs and its dual as a pair of monotropic programming problems, i.e. problems of minimizing the separable sum of scalar extended real-valued convex functions over a subspace. For such problems directions of cost improvement can be selected from among a finite set of directions--the elementary vectors of the constraint su...
متن کاملThe Minimum Universal Cost Flow in an Infeasible Flow Network
In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.
متن کاملOn Minimum Concave Cost Network Flow Problems
Minimum concave Cost Network Flow Problems (MCNFPs) arise naturally in many practical applications such as communication, transportation, distribution, and manufacturing, due to economic considerations. In addition, it has been shown that every MCNFP with general nonlinear cost functions can be transformed into a concave MCNFP on an expanded network. It must also be noted, that multiple source ...
متن کاملCombinatorial interior point methods for generalized network flow problems
We present combinatorial interior point methods for the generalized minimum cost flow and the generalized circulation problems based on Wallacher and Zimmermann’s combinatorial interior point method for the minimum cost network flow problem. The algorithms have features of both a combinatorial algorithm and an interior point method. They work towards optimality by iteratively reducing the value...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1989
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.32.174